package com.banmao.algorithm.No101To200.No112;

public class Answer {

    public static void main(String[] args) {

        Solution1 solution = new Solution1();

        Integer[] array = new Integer[] {5, 4, 8, 11, null, 13, 4, 7, 2, null, null, null, 1};

        TreeNode root = GenerateTreeNodeUtil.generateTree(array);

        boolean result = solution.hasPathSum(root, 22);
        System.out.println(result);

    }



}
